On Erlang's Formula

Offered Traffic (erlangs)

On radical formula and Prufer domains

In this paper we characterize the radical of an arbitrary‎ ‎submodule $N$ of a finitely generated free module $F$ over a‎ ‎commutatitve ring $R$ with identity‎. ‎Also we study submodules of‎ ‎$F$ which satisfy the radical formula‎. ‎Finally we derive‎ ‎necessary and sufficient conditions for $R$ to be a‎ ‎Pr$ddot{mbox{u}}$fer domain‎, ‎in terms of the radical of a‎ ‎cyclic submodule in $Rbigopl...

Remarks on Fermionic Formula

Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polynomials as sums of products of q-binomial coefficients. We consider the fermionic formulae associated with general non-twisted quantum affine algebra Uq(X (1) n ) and discuss several aspects related to representation theories and combinatorics. They include crystal base theor...

Remark on Taylor's Formula

does not contain any point of Er other than p. Cp(r]) is defined as in (5). From this it can be shown that Er has finite (n —1)-dimensional measure. Let us not assume now that r is large. We then write E = UjLxE^ where the E's are closed and their diameter is less than €. Then, by what has been shown before, if e is small enough Ef* has finite (w —1)-dimensional measure. Clearly ErCUjLxE?^'. Bu...

Formula Layout Formula Layout

Both the quality of the results of TEX s formula layout algorithm and the complexity of its description in the TEXbook are hard to beat The algorithm is verbally described as an imperative program with very complex control ow and complicated manipulations of the data structures representing formulae In a forthcoming textbook we describe TEX s formula layout algorithm as a functional program tra...